Generating the Pseudo-Powers of a Word
نویسندگان
چکیده
The notions of power of word, periodicity and primitivity are intrinsically connected to the operation of catenation, that dynamically generates word repetitions. When considering generalizations of the power of a word, other operations will be the ones that dynamically generate such pseudo-repetitions. In this paper we define and investigate the operation of θ-catenation that gives rise to the notions of θ-power (pseudopower) and θ-periodicity (pseudo-periodicity). We namely investigate the properties of θ-catenation, its connection to the previously defined notion of θ-primitive word, briefly explore closure properties of language families under θ-catenation and language operations involving this operation, and propose Abelian catenation as the operation that generates Abelian powers of words.
منابع مشابه
Predictive Risk Mapping of Leptospirosis for North of Iran Using Pseudo-absences Data
Leptospirosis is a common zoonosis disease with a high prevalence in the world and is recognized as an important public health drawback in both developing and developed countries owing to epidemics and increasing prevalence. Because of the high diversity of hosts that are capable of carrying the causative agent, this disease has an expansive geographical reach. Various environmental and social ...
متن کاملA Recipe for Short-word Pseudo-anosovs
Given any generating set of any subgroup G of the mapping class group of a surface, we find an element f with word length bounded by a constant K depending only on the surface, and with the property that the minimal subsurface supporting a power of f is as large as possible for elements of G. In particular, if G contains a pseudo-Anosov map, we find one of word length at most K. We also find ne...
متن کاملThe Neighbourhood Polynomial of some Nanostructures
The neighbourhood polynomial G , is generating function for the number of faces of each cardinality in the neighbourhood complex of a graph. In other word $N(G,x)=sum_{Uin N(G)} x^{|U|}$, where N(G) is neighbourhood complex of a graph, whose vertices are the vertices of the graph and faces are subsets of vertices that have a common neighbour. In this paper we compute this polynomial for some na...
متن کاملSums of powers : an arithmetic refinement to the probabilistic model of Erdős and Rényi
Erdős and Rényi proposed in 1960 a probabilistic model for sums of s integral sth powers. Their model leads almost surely to a positive density for sums of s pseudo sth powers, which does not reflect the case of sums of two squares. We refine their model by adding arithmetical considerations and show that our model is in accordance with a zero density for sums of two pseudo-squares and a positi...
متن کاملDe Bruijn Sequences Revisited
A (non-circular) de Bruijn sequence w of order n is a word such that every word of length n appears exactly once in w as a factor. In this paper, we generalize the concept to different settings: the multi-shift de Bruijn sequence and the pseudo de Bruijn sequence. An m-shift de Bruijn sequence of order n is a word such that every word of length n appears exactly once in w as a factor that start...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Automata, Languages and Combinatorics
دوره 19 شماره
صفحات -
تاریخ انتشار 2014